Strong edge coloring sparse graphs
نویسندگان
چکیده
منابع مشابه
Acyclic edge coloring of sparse graphs
A proper edge coloring of a graph G is called acyclic if there is no bichromatic cycle in G. The acyclic chromatic index of G, denoted by χa(G), is the least number of colors k such that G has an acyclic edge k-coloring. The maximum average degree of a graph G, denoted by mad(G), is the maximum of the average degree of all subgraphs of G. In this paper, it is proved that if mad(G) < 4, then χa(...
متن کاملPerfection for strong edge-coloring on graphs
A strong edge-coloring of a graph is a function that assigns to each edge a color such that every two distinct edges that are adjacent or adjacent to a same edge receive different colors. The strong chromatic index χs(G) of a graph G is the minimum number of colors used in a strong edge-coloring of G. From a primal-dual point of view, there are three natural lower bounds of χs(G), that is σ(G) ...
متن کاملStrong edge-coloring for jellyfish graphs
A strong edge-coloring of a graph is a function that assigns to each edge a color such that two edges within distance two apart receive different colors. The strong chromatic index of a graph is the minimum number of colors used in a strong edge-coloring. This paper determines strong chromatic indices of cacti, which are graphs whose blocks are cycles or complete graphs of two vertices. The pro...
متن کاملStrong edge-coloring for cubic Halin graphs
A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.06.104